Representation theorems for fuzzy orders and quasi-metrics
نویسنده
چکیده
Let L be a complete residuated lattice. Then we show that any L-preorder can be represented both by an implication-based graded inclusion as defined [1] and by a similarity-based graded inclusion as defined in [2]. Also, in accordance with a duality between [0,1]-orders and quasi-metrics, we obtain two corresponding representation theorems for quasi-metrics.
منابع مشابه
WEAK AND STRONG DUALITY THEOREMS FOR FUZZY CONIC OPTIMIZATION PROBLEMS
The objective of this paper is to deal with the fuzzy conic program- ming problems. The aim here is to derive weak and strong duality theorems for a general fuzzy conic programming. Toward this end, The convexity-like concept of fuzzy mappings is introduced and then a speci c ordering cone is established based on the parameterized representation of fuzzy numbers. Un- der this setting, duality t...
متن کامل1 Fuzzy Orders in Approximate Reasoning
An approach to fixed point theory based on the notion of fuzzy order is proposed. Such an approach extends both the fixed point theory in ordered sets and the fixed point theory in metric spaces. This since the fuzzy orders are strictly related with the quasi-metrics as defined by A. K. Seda in [10]. The aim is to give new tools for logic programming and for approximate reasoning.
متن کاملQuasi-contractive Mappings in Fuzzy Metric Spaces
We consider the concept of fuzzy quasi-contractions initiated by '{C}iri'{c} in the setting of fuzzy metric spaces and establish fixed point theorems for quasi-contractive mappings and for fuzzy $mathcal{H}$-contractive mappings on M-complete fuzzy metric spaces in the sense of George and Veeramani.The results are illustrated by a representative example.
متن کاملSome Properties and Applications of Fuzzy Quasi-Pseudo-Metric Spaces
Abstract. In this paper we establish some properties of fuzzy quasi-pseudo-metric spaces. An important result is that any partial ordering can be defined by a fuzzy quasi-metric, which can be applied both in theoretical computer science and in information theory, where it is usual to work with sequences of objects of increasing information. We also obtain decomposition theorems of a fuzzy quasi...
متن کاملrepresentation theorems of $L-$subsets and $L-$families on complete residuated lattice
In this paper, our purpose is twofold. Firstly, the tensor andresiduum operations on $L-$nested systems are introduced under thecondition of complete residuated lattice. Then we show that$L-$nested systems form a complete residuated lattice, which isprecisely the classical isomorphic object of complete residuatedpower set lattice. Thus the new representation theorem of$L-$subsets on complete re...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Soft Comput.
دوره 8 شماره
صفحات -
تاریخ انتشار 2004